Minimization Algorithms and Random Walk on the $d$-Cube
نویسندگان
چکیده
منابع مشابه
Random Walk Approach to Regret Minimization
We propose a computationally efficient random walk on a convex body which rapidly mixes to a time-varying Gibbs distribution. In the setting of online convex optimization and repeated games, the algorithm yields low regret and presents a novel efficient method for implementing mixture forecasting strategies.
متن کاملOn the efficiency of pseudo-marginal random walk Metropolis algorithms
We examine the behaviour of the pseudo-marginal random walk Metropolis algorithm, where evaluations of the target density for the accept/reject probability are estimated rather than computed precisely. Under relatively general conditions on the target distribution, we obtain limiting formulae for the acceptance rate and for the expected squared jump distance, as the dimension of the target appr...
متن کاملAnalysis of Random Noise and Random Walk Algorithms
Random Noise and RandomWalk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis of the performance of these algorithms. The performance measures we consider are the probability of finding a satisfying assignment and the distribution of the best solution observed on a given SAT instance. The analysis...
متن کاملOptimized quantum random-walk search algorithms
Shenvi, Kempe and Whaley’s quantum random-walk search (SKW) algorithm [2003 Phys. Rev. A 67 052307] is known to require O( √ N) number of oracle queries to find the marked element, where N is the size of the search space. This scaling is thought to be the best achievable on a quantum computer. We prove that the final state of the quantum walk in the SKW algorithm yields the nearest neighbours o...
متن کاملA random walk approach to quantum algorithms.
The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial; pure quantum dynamics is deterministic, so randomness only enters during the measurement phase, i.e. when converting the quantum information into classical information. The ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 1983
ISSN: 0091-1798
DOI: 10.1214/aop/1176993605